Semantics and verification in process algebras with data and timing
نویسنده
چکیده
ing from the data in a specification is in many situations undesirable. As mentioned in the prelude to this chapter, the process languages pCRL, pCRLt and μCRLt are designed to support the specification of data-dependent systems. The data, and the datatypes, used in e.g. μCRLt-specifications are specified using the theoretically sound and flexible (yet impractical) framework of (equational) abstract data-types. A data-type is specified as a data-sort, using the reserved word sort. To each sort, a number of constructors, (preceded by the reserved word func) and functions (preceded by the reserved word map) are associated. A sort represents a non-empty set of data elements. Whenever a sort D is declared without any constructors with target sort D, then it is assumed that D may be arbitrarily large. The equations associated to a data-sort define which data expressions are assumed equal. Preceding these equations is the keyword rew, and, possibly var, declaring the variables used in the equations. Specification techniques, similar to the one sketched here, can be found in e.g. [95, 24]. Example 2.1.1. An example of a data-type is the set of natural numbers, on which we define addition and multiplication. The equations express elementary laws for addition and multiplication
منابع مشابه
STONE DUALITY FOR R0-ALGEBRAS WITH INTERNAL STATES
$Rsb{0}$-algebras, which were proved to be equivalent to Esteva and Godo's NM-algebras modelled by Fodor's nilpotent minimum t-norm, are the equivalent algebraic semantics of the left-continuous t-norm based fuzzy logic firstly introduced by Guo-jun Wang in the mid 1990s.In this paper, we first establish a Stone duality for the category of MV-skeletons of $Rsb{0}$-algebras and the category of t...
متن کاملSpecification and Analysis of Hardware Systems Using Timed Process Algebras
The ability of unambiguously specifying (in a mathematical sense) and rigorously analysing timing properties/constraints is fundamental to design correct hardware systems. Formalisms in which hardware behaviour and timing properties can be precisely captured is a mandatory prerequisite for designing correct hardware systems (discrete-time systems by nature). Timed process algebras are such form...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملAn Algebraic Theory of Multiple Clocks
This paper develops a temporal process algebra, CSA, for reasoning about distributed systems that involve qualitative timing constraints. It is a conservative extension of Milner's CCS that combines the idea of multiple clocks from the algebra PMC with the assumption of maximal progress familiar from timed process algebras such as TPL. Using a typical class of examples drawn from hardware desig...
متن کاملProcess-Algebraic Interpretation of AADL Models
We present a toolset for the behavioral verification and validation of architectural models of embedded systems expressed in the language AADL. The toolset provides simulation and timing analysis of AADL models. Underlying both tools is a process-algebraic implementation of AADL semantics. The common implementation of the semantics ensures consistency in the analysis results between the tools. ...
متن کامل